Search scope:
排序: Display mode:
Identity-based threshold proxy re-encryption scheme from lattices and its applications Research Articles
Liqiang WU, Yiliang HAN, Xiaoyuan YANG, Minqing ZHANG,latticewj@163.com,hanyil@163.com
Frontiers of Information Technology & Electronic Engineering 2022, Volume 23, Issue 2, Pages 258-277 doi: 10.1631/FITEE.2000366
Keywords: Post-quantum cryptography Threshold proxy re-encryption Lattices Robustness Decentralization
Novel efficient identity-based signature on lattices
Jiang-shan Chen, Yu-pu Hu, Hong-mei Liang, Wen Gao,JSChen@mnnu.edu.cn
Frontiers of Information Technology & Electronic Engineering 2021, Volume 22, Issue 2, Pages 141-286 doi: 10.1631/FITEE.1900318
Keywords: Identity-based signature Lattice Strong unforgeability Random oracle model
Verifier-local revocation group signatures with backward unlinkability from lattices Research Articles
Yanhua ZHANG, Ximeng LIU, Yupu HU, Yong GAN, Huiwen JIA
Frontiers of Information Technology & Electronic Engineering 2022, Volume 23, Issue 6, Pages 876-892 doi: 10.1631/FITEE.2000507
For (GS) supporting membership revocation, (VLR) mechanism seems to be a more flexible choice, because it requires only that verifiers download up-to-date revocation information for signature verification, and the signers are not involved. As a post-quantum secure cryptographic counterpart of classical number-theoretic cryptographic constructions, the first lattice-based VLR (VLR-GS) was introduced by Langlois et al. (2014). However, none of the contemporary lattice-based VLR-GS schemes provide backward unlinkability (BU), which is an important property to ensure that previously issued signatures remain anonymous and unlinkable even after the corresponding signer (i.e., member) is revoked. In this study, we introduce the first lattice-based VLR-GS scheme with BU security (VLR-GS-BU), and thus resolve a prominent open problem posed by previous works. Our new scheme enjoys an (log) factor saving for bit-sizes of the group public-key (GPK) and the member's signing secret-key, and it is free of any public-key encryption. In the random oracle model, our scheme is proven secure under two well-known hardness assumptions of the (SIS) problem and learning with errors (LWE) problem.
Keywords: Group signature Lattice-based cryptography Verifier-local revocation Backward unlikability Short integer solution
Title Author Date Type Operation
Identity-based threshold proxy re-encryption scheme from lattices and its applications
Liqiang WU, Yiliang HAN, Xiaoyuan YANG, Minqing ZHANG,latticewj@163.com,hanyil@163.com
Journal Article
Novel efficient identity-based signature on lattices
Jiang-shan Chen, Yu-pu Hu, Hong-mei Liang, Wen Gao,JSChen@mnnu.edu.cn
Journal Article